On the Foundations of Vision Modeling V. Noncommutative Monoids of Occlusive Preimages

نویسنده

  • Jianhong Shen
چکیده

A significant cue for visual perception is the occlusion pattern in 2-D images projected onto biological or digital retinas, which allows humans or robots to successfully sense and navigate the 3-D environments. There have been many works on modeling and studying the role of occlusion in image analysis and visual perception, mostly from analytical or statistical points of view. The current paper presents a new theory of occlusion based on simple topological definitions of preimages and a binary operation on them called “occlu.” We study many topological as well as algebraic structures of the resultant preimage monoids (a monoid is a semigroup with identity). The current paper is intended to foster the connection between mathematical ways of abstract thinking and realistic modeling of human and computer vision.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On uniformly continuous functions for some profinite topologies

Given a variety of finite monoids V, a subset of a monoid is a V-subset if its syntactic monoid belongs to V. A function between two monoids is V-preserving if it preservesV-subsets under preimages and it is hereditary V-preserving if it is W-preserving for every subvariety W of V. The aim of this paper is to study hereditary V-preserving functions when V is one of the following varieties of fi...

متن کامل

Minimal Noncommutative Varieties and Power Varieties

A variety of finite monoids is a class of finite monoids closed under taking submonoids, quotients and finite direct products. A language L is a subset of a finitely generated free monoid. The variety theorem of Eilenberg sets up a one to one correspondence between varieties of finite monoids and classes of languages called, appropriately, varieties of languages. Recent work in variety theory h...

متن کامل

On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains

In this paper we show some lower bounds for the size of multiplicative circuits computing multi-output functions in some noncommutative domains like monoids and finite groups. We also introduce and study a generalization of linear circuits in which the goal is to compute MY where Y is a vector of indeterminates and M is a matrix whose entries come from noncommutative rings. We show some lower b...

متن کامل

A note on power values of generalized derivation in prime ring and noncommutative Banach algebras

Let $R$ be a prime ring with extended centroid $C$, $H$ a generalized derivation of $R$ and $ngeq 1$ a fixed integer. In this paper we study the situations: (1) If $(H(xy))^n =(H(x))^n(H(y))^n$ for all $x,yin R$; (2) obtain some related result in case $R$ is a noncommutative Banach algebra and $H$ is continuous or spectrally bounded.

متن کامل

Classification of monoids by Condition $(PWP_{ssc})$

Condition $(PWP)$ which was introduced in (Laan, V., {it Pullbacks and flatness properties of acts I}, Commun. Algebra, 29(2) (2001), 829-850), is related to flatness concept of acts over monoids. Golchin and Mohammadzadeh in ({it On Condition $(PWP_E)$}, Southeast Asian Bull. Math., 33 (2009), 245-256) introduced Condition $(PWP_E)$, such that Condition $(PWP)$ implies it, that is, Condition $...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004